A Formal Semantics of the GraalVM Intermediate Representation

The optimization phase of a compiler is responsible for transforming an intermediate representation (IR) program into more efficient form. Modern optimizers, such as that used in the GraalVM compiler, use IR consisting sophisticated graph data structure combines flow and control one structure. As part wider project on verification passes GraalVM, this paper describes semantics its within Isabelle/HOL. consists big-step operational nodes (which are represented graph-based static single assignment (SSA) form) small-step handling including heap-based reads writes, exceptions, method calls. We have proved suite canonicalization optimizations conditional elimination with respect to semantics.